一类精细化Eulerian多项式的若干性质

最近,孙华定义了一类新的精细化Eulerian多项式,即$$A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)},\ \ n\ge 1,$$ 其中$S_n$表示$\{1,2,\ldots,n\}$上全体$n$阶排列的集合, odes$(\pi)$与edes$(\pi)$分别表示$S_n$中排列$\pi$的奇数位与偶数位上降位数的个数.本文利用经典的Eulerian多项式$A_n(q)$ 与Catalan 序列的生成函数$C(q)$,得到精细化Eulerian 多项式$A_n(p,q)$的指数型生成函数及$A_n(p,q)$的显示表达式.在一些特殊情形,本文建立了$A_n(p,q)$与$A_n(0,q)$或$A_n(p,0)$之间的联系,并利用Eulerian数表示多项式$A_n(0,q)$的系数.特别地,这些联系揭示了Euler数$E_n$与Eulerian数$A_{n,k}$之间的一种新的关系.     

Simultaneous quantification of ondansetron and tariquidar in rat and human plasma using a high performance liquid chromatography‐ultraviolet method

Ondansetron, a widely used antiemetic agent, is a P‐glycoprotein (P‐gp) substrate and therefore expression of P‐gp at the blood–brain barrier limits its distribution to the central nervous system (CNS), which was observed to be reversed by coadministration with P‐gp inhibitors. Tariquidar is a potent and selective third‐generation P‐gp inhibitor, and coadministration with ondansetron has shown improved ondansetron distribution to the CNS. There is currently no reported bioanalytical method for simultaneously quantifying ondansetron with a third‐generation P‐gp inhibitor. Therefore, we aimed to develop and validate a method for ondansetron and tariquidar in rat and human plasma samples. A full validation was performed for both ondansetron and tariquidar, and sample stability was tested under various storage conditions. To demonstrate its utility, the method was applied to a preclinical pharmacokinetic study following coadministration of ondansetron and tariquidar in rats. The presented method will be valuable in pharmacokinetic studies of ondansetron and tariquidar in which simultaneous determination may be required. In addition, this is the first report of a bioanalytical method validated for quantification of tariquidar in plasma samples.     

The (S−1,S) inventory model and its counterparts in queueing theory

We explore the relationship between the ($S?1,S$) inventory model and three well-known queueing models: the Erlang loss system, the machine-repair model and a two-node Jackson network. Exploiting this relationship allows us to obtain key performance measures of the ($S?1,S$) model, like the so-called virtual outdating time, the number of items on the shelf in steady state, the long-run rate of unsatisfied demands and the distribution of the empty shelf period.     

Infinite propagation speed of a weakly dissipative modified two-component Dullin–Gottwald–Holm system

We consider the infinite propagation speed of a weakly dissipative modified two-component Dullin–Gottwald–Holm (mDGH2) system. The infinite propagation speed is derived for the corresponding solution with compactly supported initial data that does not have compact support any longer in its lifespan.     

Using block designs in crossing number bounds

The crossing number $\mathrm{\text{CR}}\left(G\right)$ of a graph $G=\left(V,E\right)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$‐planar crossing number of $G,{\mathrm{\text{CR}}}_k\left(G\right)$, is defined as the minimum of $\text{CR}\left(G_1\right)+\text{CR}\left(G_2\right)+?+\text{CR}\left(G_k\right)$ over all graphs $G_1,G_2,\dots ,G_k$ with ${\cup }_{i=1}^k{G}_i=G$. Pach et al [Comput. Geom.: Theory Appl. 68 (2018), pp. 2–6] showed that for every $k\ge 1$, we have ${\text{CR}}_k\left(G\right)\le (2/k^2?1/k^3)\text{CR}\left(G\right)$ and that this bound does not remain true if we replace the constant $2/k^2?1/k^3$ by any number smaller than $1/k^2$. We improve the upper bound to $(1/k^2)\left(1+o\left(1\right)\right)$ as $k\to \infty$. For the class of bipartite graphs, we show that the best constant is exactly $1/k^2$ for every $k$. The results extend to the rectilinear variant of the $k$‐planar crossing number.     

Simultaneous separation and determination of seven isoflavones in Radix Puerariae by capillary electrophoresis with a dual cyclodextrin system

A simple, comprehensive and efficient capillary electrophoresis method using a dual cyclodextrin system was developed for the simultaneous determination of seven isoflavones (3′‐methoxypuerarin, puerarin, 3′‐hydroxypuerarin, ononin, daidzin, daidzein and genistin). Baseline separations of the seven isoflavones were achieved within 11 min with the running buffer consisting of 35 mm sodium tetraborate, 9.0 mm sulfobutylether‐β‐cyclodextrin and 30 mm α‐cyclodextrin at pH 9.34, and peaks were detected at 254 nm. Other separation parameters included the separation voltage for 15 kV and the working temperature for 25°C. Under the optimum conditions, good linearities were obtained with linear correlation coefficients of seven isoflavones of 0.9978–0.9992. The limits of detection and the limits of quantification were 0.7–2.9 and 2.5–9.5 μg/mL, respectively. Excellent precision and accuracy were obtained. The intraday and interday precision ranged from 0.7 to 2.0% and from 0.8 to 1.9%, respectively. The recoveries of seven analytes were from 97.7 to 103.1%. This method was successfully applied to determine the seven analytes in Radix Puerariae and its preparations.     

Embedding hypertrees into steiner triple systems

In this paper, we are interested in the following question: given an arbitrary Steiner triple system on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive.